Dynamically generating problems on static scope
نویسندگان
چکیده
منابع مشابه
Towards Generating Recommendations on Large Dynamically Growing Domains
Overwhelming increase in the amount of information raise a requirement of personalized recommendation system. A vast amount of studies have applied traditional collaborative filtering (CF) techniques for generating recommendations. However, well-known scalability issue imposes a limit on its general application. Association Rule based CF techniques where the association rules are primarily gene...
متن کاملDynamically Generating Conformance Tests for Messaging Systems
The advent of XML technologies for data exchange negotiations in B2B applications is proliferating a new class of messaging standards that are only fully designed at the implementation level. These specifications offer unmatched flexibility. However, this presents a challenge for ensuring correctness, as each implementation is potentially unique--conformance tests are needed. We propose a gener...
متن کاملPosting Static Symmetry Breaking Constraints Dynamically
Symmetry is an important feature of many combinatorial search problems. We propose a new method for dynamically posting static symmetry breaking constraints during search. This method is based on the observations that any symmetry of a set of symmetry breaking constraints can be used to break symmetry, and different symmetries pick out different solutions. We choose which symmetry to post as br...
متن کاملOn Generating Solved Instances of Computational Problems
We consider the e cient generation of solved instances of computational problems. In particular, we consider invulnerable generators. Let S be a subset of f0; 1g and M be a Turing Machine that accepts S; an accepting computation w of M on input x is called a \witness" that x 2 S. Informally, a program is an -invulnerable generator if, on input 1 n , it produces instancewitness pairs hx; wi, wit...
متن کاملGenerating Hard Satisfiability Problems
We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite diffi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCSE Bulletin
سال: 2000
ISSN: 0097-8418
DOI: 10.1145/353519.343055